Energy metabolism and glutamate-glutamine cycle in the brain: a stoichiometric modeling perspective

Background: The energetics of cerebral activity critically relies on the functional and metabolic interactions between neurons and astrocytes. Important open questions include the relation between neuronal versus astrocytic energy demand, glucose uptake and intercellular lactate transfer, as well as their dependence on the level of activity. Results: We have developed a large-scale, constraint-based network model of the metabolic partnership between astrocytes and glutamatergic neurons that allows for a quantitative appraisal of the extent to which stoichiometry alone drives the energetics of the system. We find that the velocity of the glutamate-glutamine cycle (Vcyc) explains part of the uncoupling between glucose and oxygen utilization at increasing Vcyc levels. Thus, we are able to characterize different activation states in terms of the tissue oxygen-glucose index (OGI). Calculations show that glucose is taken up and metabolized according to cellular energy requirements, and that partitioning of the sugar between different cell types is not significantly affected by Vcyc. Furthermore, both the direction and magnitude of the lactate shuttle between neurons and astrocytes turn out to depend on the relative cell glucose uptake while being roughly independent of Vcyc. Conclusions: These findings suggest that, in absence of ad hoc activity-related constraints on neuronal and astrocytic metabolism, the glutamate-glutamine cycle does not control the relative energy demand of neurons and astrocytes, and hence their glucose uptake and lactate exchange. © 2013 Massucci et al.; licensee BioMed Central Ltd

Optimization viewpoint on Kalman smoothing, with applications to robust and sparse estimation

In this paper, we present the optimization formulation of the Kalman filtering and smoothing problems, and use this perspective to develop a variety of extensions and applications. We first formulate classic Kalman smoothing as a least squares problem, highlight special structure, and show that the classic filtering and smoothing algorithms are equivalent to a particular algorithm for solving this problem. Once this equivalence is established, we present extensions of Kalman smoothing to systems with nonlinear process and measurement models, systems with linear and nonlinear inequality constraints, systems with outliers in the measurements or sudden changes in the state, and systems where the sparsity of the state sequence must be accounted for. All extensions preserve the computational efficiency of the classic algorithms, and most of the extensions are illustrated with numerical examples, which are part of an open source Kalman smoothing Matlab/Octave package.Comment: 46 pages, 11 figure

Multi-Target Prediction: A Unifying View on Problems and Methods

Multi-target prediction (MTP) is concerned with the simultaneous prediction of multiple target variables of diverse type. Due to its enormous application potential, it has developed into an active and rapidly expanding research field that combines several subfields of machine learning, including multivariate regression, multi-label classification, multi-task learning, dyadic prediction, zero-shot learning, network inference, and matrix completion. In this paper, we present a unifying view on MTP problems and methods. First, we formally discuss commonalities and differences between existing MTP problems. To this end, we introduce a general framework that covers the above subfields as special cases. As a second contribution, we provide a structured overview of MTP methods. This is accomplished by identifying a number of key properties, which distinguish such methods and determine their suitability for different types of problems. Finally, we also discuss a few challenges for future research

Seizure prediction : ready for a new era

Acknowledgements: The authors acknowledge colleagues in the international seizure prediction group for valuable discussions. L.K. acknowledges funding support from the National Health and Medical Research Council (APP1130468) and the James S. McDonnell Foundation (220020419) and acknowledges the contribution of Dean R. Freestone at the University of Melbourne, Australia, to the creation of Fig. 3.Peer reviewedPostprin

A second order sliding mode controller with polygonal constraints

It is presented a discontinuous controller that ensure uniform finite-time zero stabilization of the output for uncertain SISO systems of relative degree two, while keeping the auxiliary system state within a prescribed convex polygon. The proposed method extends applicability of second order sliding modes controllers to the case of uncertain dynamical systems with constraints

Bayesian on-line multi-task learning of Gaussian processes

Standard single-task kernel methods have recently been extended to the case of multitask learning in the context of regularization theory. There are experimental results, especially in biomedicine, showing the benefit of the multitask approach compared to the single-task one. However, a possible drawback is computational complexity. For instance, when regularization networks are used, complexity scales as the cube of the overall number of training data, which may be large when several tasks are involved. The aim of this paper is to derive an efficient computational scheme for an important class of multitask kernels. More precisely, a quadratic loss is assumed and each task consists of the sum of a common term and a task-specific one. Within a Bayesian setting, a recursive online algorithm is obtained, which updates both estimates and confidence intervals as new data become available. The algorithm is tested on two simulated problems and a real data set relative to xenobiotics administration in human patients